Geodesic trajectories on regular polyhedra
نویسندگان
چکیده
Consider all geodesics between two given points on a polyhedron. On the regular tetrahedron, we describe all the geodesics from a vertex to a point, which could be another vertex. Using the Stern– Brocot tree to explore the recursive structure of geodesics between vertices on a cube, we prove, in some precise sense, that there are twice as many geodesics between certain pairs of vertices than other pairs. We also obtain the fact that there are no geodesics that start and end at the same vertex on the regular tetrahedron or the cube.
منابع مشابه
Geodesic Ideal Triangulations Exist Virtually
It is shown that every non-compact hyperbolic manifold of finite volume has a finite cover admitting a geodesic ideal triangulation. Also, every hyperbolic manifold of finite volume with non-empty, totally geodesic boundary has a finite regular cover which has a geodesic partially truncated triangulation. The proofs use an extension of a result due to Long and Niblo concerning the separability ...
متن کاملGeodesic Discrete Global Grid Systems
In recent years, a number of data structures for global geo-referenced data sets have been proposed based on regular, multi-resolution partitions of polyhedra. We present a survey of the most promising of such systems, which we call Geodesic Discrete Global Grid Systems (Geodesic DGGSs). We show that Geodesic DGGS alternatives can be constructed by specifying five substantially independent desi...
متن کاملFullerenes and coordination polyhedra versus half-cube embeddings
A fullerene F, is a 3-regular (or cubic) polyhedral carbon molecule for which the n vertices the carbons atoms are arranged in 12 pentagons and (n/210) hexagons. Only a finite number of fullerenes are expected to be, up to scale, isometrically embeddable into a hypercube. Looking for the list of such fullerenes, we first check the embeddability of all fullerenes F, for n < 60 and of all prefera...
متن کاملConvex Polyhedra without Simple Closed Geodesics
In 1905, in his famous article “Sur les lignes géodésiques des surfaces convexes” [1] H. Poincaré posed a question on the existence of at least three geometrically different closed geodesics without self-intersections on any smooth convex two-dimensional surface (2-surface) M homeomorphic to the two-dimensional sphere (2-sphere) S2. Each such geodesic splits the surface M into two domains homeo...
متن کاملFaster Approximations of Shortest Geodesic Paths on Polyhedra Through Adaptive Priority Queue
Computing shortest geodesic paths is a crucial problem in several application areas, including robotics, medical imaging, terrain navigation and computational geometry. This type of computation on triangular meshes helps to solve different tasks, such as mesh watermarking, shape classification and mesh parametrization. In this work, a priority queue based on a bucketing structure is applied to ...
متن کامل